Quotienting the Delay Monad by Weak Bisimilarity
نویسندگان
چکیده
The delay datatype was introduced by Capretta [2] as a means to incorporate general recursion to Martin-Löf type theory and it is useful in this setting for modeling non-terminating behaviours. This datatype is a (strong) monad and constitutes a constructive alternative to the maybe monad. For a given set X, each element of DX is a possibly infinite computation that returns a value of X, if it terminates. We define DX as a coinductive type by the rules
منابع مشابه
Partiality, Revisited - The Partiality Monad as a Quotient Inductive-Inductive Type
Capretta’s delay monad can be used to model partial computations, but it has the “wrong” notion of built-in equality, strong bisimilarity. An alternative is to quotient the delay monad by the “right” notion of equality, weak bisimilarity. However, recent work by Chapman et al. suggests that it is impossible to define a monad structure on the resulting construction in common forms of type theory...
متن کاملThe Delay Monad and Restriction Categories
We continue the study of Capretta’s delay monad as a means of introducing non-termination from iteration into Martin-Löf type theory. In particular, we explain in what sense this monad provides a canonical solution. We discuss a class of monads that we call ω-complete pointed classifying monads. These are monads whose Kleisli category is an ωcomplete pointed restriction category where pure maps...
متن کاملNormalization by Evaluation in the Delay Monad
We present an Agda formalization of a normalization proof for simply-typed lambda terms. The normalizer consists of two coinductively defined functions in the delay monad: One is a standard evaluator of lambda terms to closures, the other a type-directed reifier from values to η-long β-normal forms. Their composition, normalization-by-evaluation, is shown to be a total function a posteriori, us...
متن کاملDivide and Congruence II: From Decomposition of Modal Formulas to Preservation of Delay and Weak Bisimilarity
Earlier we presented a method to decompose modal formulas for processes with the internal action τ , and congruence formats for branching and η-bisimilarity were derived on the basis of this decomposition method. The idea is that a congruence format for a semantics must ensure that the formulas in the modal characterisation of this semantics are always decomposed into formulas that are again in...
متن کاملApplication of monadic substitution to recursive type containment
In this paper, we present a computer-checked, constructive soundness and completeness result for prototypic recursive type containment with respect to containment of nonwellfounded (finite or infinite) trees. The central role is played by formalisation of substitution of recursive types as a monad, with a traverse function implementing a strategy for potentially infinite recursive unfolding. In...
متن کامل